a=int(input())
q=1
w=1
h=''
for s in range(1,a+1):
if w==s:
h+='O'
q,w=w,q+w
else:
h+='o'
print(h)
/* بِسْمِ اللَّـهِ الرَّحْمَـٰنِ الرَّحِيمِ */
#include<bits/stdc++.h>
#define accelerate cin.tie(0); cin.sync_with_stdio(0);
typedef long long ll;
using namespace std;
bool sortPairBySecondElement(const pair<int, int> &a, const pair<int, int> &b);
vector<ll> factorization(ll n);
vector<bool> segmentedSieve(long long L, long long R);
bool isPrim(ll number);
vector<bool> sieve(ll sieveNumber);
long long binaryExponentiation(long long number, long long power, int mod);
bool fre[2000];
int coun;
int maxi[5000];
int fib(int number) {
if (number <= 1)
return 1;
if (maxi[number])
return maxi[number];
maxi[number] = fib(number - 1) + fib(number - 2);
fre[maxi[number]] = true;
return maxi[number];
}
int main() {
accelerate
fib(17);
int input;
cin >> input;
for (int i = 1; i <= input; ++i) {
if (fre[i] || i == 1)cout << 'O';
else cout << 'o';
}
}
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |